A Smoothing Descent Method for Nonconvex TV $$^q$$ -Models
نویسندگان
چکیده
A novel class of variational models with nonconvex `q-normtype regularizations (0 < q < 1) is considered, which typically outperforms popular models with convex regularizations in restoring sparse images. Due to the fact that the objective function is nonconvex and nonLipschitz, such models are very challenging from an analytical as well as numerical point of view. In this work a smoothing descent method with provable convergence properties is proposed for computing stationary points of the underlying variational problem. Numerical experiments are reported to illustrate the effectiveness of the new method.
منابع مشابه
A Smoothing Descent Method for Nonconvex TV-Models
A novel class of variational models with nonconvex lq-normtype regularizations (0 < q < 1) is considered, which typically outperforms those models with convex regularizations in restoring sparse images. Due to the fact that the objective function is nonconvex and non-Lipschitz, such nonconvex models are very challenging from an analytical as well as numerical point of view. In this work we prop...
متن کاملQuantum Tv and Applications in Image Processing
Closely inspired by the total variation (TV) model of Rudin, Osher and Fatemi [Physica D, 60:259-268,1992], we propose the quantized or quantum TV model (either with a preassigned quanta set Q or without), and study the associated mathematical properties and computational algorithms. An algorithm based on stochastic or Markovian gradient descent is proposed to handle the discrete programming na...
متن کاملLimiting Aspects of Nonconvex TVφ Models
Recently, nonconvex regularization models have been introduced in order to provide a better prior for gradient distributions in real images. They are based on using concave energies φ in the total variation–type functional TV(u) := ∫ φ(|∇u(x)|) dx. In this paper, it is demonstrated that for typical choices of φ, functionals of this type pose several difficulties when extended to the entire spac...
متن کاملIteration Bounds for Finding the -Stationary Points for Structured Nonconvex Optimization
In this paper we study proximal conditional-gradient (CG) and proximal gradient-projection type algorithms for a block-structured constrained nonconvex optimization model, which arises naturally from tensor data analysis. First, we introduce a new notion of -stationarity, which is suitable for the structured problem under consideration. We then propose two types of first-order algorithms for th...
متن کاملEfficient ℓq Minimization Algorithms for Compressive Sensing Based on Proximity Operator
This paper considers solving the unconstrained lq-norm (0 ≤ q < 1) regularized least squares (lq-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via incorporating the proximity operator for nonconvex lq-norm functions into the fast iterative shrinkage/thresholding (FISTA) and the alternative direction method of multipliers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011